Factorisation of Greedoid Polynomials of Rooted Digraphs

Gordon and McMahon defined a two-variable greedoid polynomial f(G; t, z) for any G. They studied polynomials greedoids associated with rooted graphs digraphs. proved that of digraphs have the multiplicative direct sum property. In addition, these are divisible by $$1 + z$$ under certain conditions. We compute all up to order six. A is said factorise if it has non-constant factor lower degree. study factorability digraphs, particularly those not . give some examples an infinite family sums but their factorise.